// @ts-nocheck
const scrypt = async (password, salt, options) => {
	const { N, r, p } = options;
	const dkLen = options.dkLen ?? 32;
	const maxmem = 1024 ** 3 + 1024;
	const blockSize = 128 * r;
	const blockSize32 = blockSize / 4;
	if (
		N <= 1 ||
		(N & (N - 1)) !== 0 ||
		N >= 2 ** (blockSize / 8) ||
		N > 2 ** 32
	) {
		throw new Error(
			"Scrypt: N must be larger than 1, a power of 2, less than 2^(128 * r / 8) and less than 2^32",
		);
	}
	if (p < 0 || p > ((2 ** 32 - 1) * 32) / blockSize) {
		throw new Error(
			"Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)",
		);
	}
	if (dkLen < 0 || dkLen > (2 ** 32 - 1) * 32) {
		throw new Error(
			"Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32",
		);
	}
	const memUsed = blockSize * (N + p);
	if (memUsed > maxmem) {
		throw new Error(
			`Scrypt: parameters too large, ${memUsed} (128 * r * (N + p)) > ${maxmem} (maxmem)`,
		);
	}
	const B = await pbkdf2(password, salt, { c: 1, dkLen: blockSize * p });
	const B32 = u32(B);
	const V = u32(new Uint8Array(blockSize * N));
	const tmp = u32(new Uint8Array(blockSize));
	for (let pi = 0; pi < p; pi++) {
		const Pi = blockSize32 * pi;
		for (let i = 0; i < blockSize32; i++) V[i] = B32[Pi + i]; // V[0] = B[i]
		for (let i = 0, pos = 0; i < N - 1; i++) {
			BlockMix(V, pos, V, (pos += blockSize32), r); // V[i] = BlockMix(V[i-1]);
			await new Promise((r) => r()); // await next tick
		}
		BlockMix(V, (N - 1) * blockSize32, B32, Pi, r); // Process last element
		for (let i = 0; i < N; i++) {
			// First u32 of the last 64-byte block (u32 is LE)
			const j = B32[Pi + blockSize32 - 16] % N; // j = Integrify(X) % iterations
			for (let k = 0; k < blockSize32; k++) {
				tmp[k] = B32[Pi + k] ^ V[j * blockSize32 + k]; // tmp = B ^ V[j]
			}
			BlockMix(tmp, 0, B32, Pi, r); // B = BlockMix(B ^ V[j])
			await new Promise((r) => r()); // await next tick
		}
	}
	const res = await pbkdf2(password, B, { c: 1, dkLen });
	B.fill(0);
	V.fill(0);
	tmp.fill(0);
	return res;
};
const rotl = (a, b) => (a << b) | (a >>> (32 - b));
const XorAndSalsa = (prev, pi, input, ii, out, oi) => {
	const y00 = prev[pi++] ^ input[ii++],
		y01 = prev[pi++] ^ input[ii++];
	const y02 = prev[pi++] ^ input[ii++],
		y03 = prev[pi++] ^ input[ii++];
	const y04 = prev[pi++] ^ input[ii++],
		y05 = prev[pi++] ^ input[ii++];
	const y06 = prev[pi++] ^ input[ii++],
		y07 = prev[pi++] ^ input[ii++];
	const y08 = prev[pi++] ^ input[ii++],
		y09 = prev[pi++] ^ input[ii++];
	const y10 = prev[pi++] ^ input[ii++],
		y11 = prev[pi++] ^ input[ii++];
	const y12 = prev[pi++] ^ input[ii++],
		y13 = prev[pi++] ^ input[ii++];
	const y14 = prev[pi++] ^ input[ii++],
		y15 = prev[pi++] ^ input[ii++];
	let x00 = y00,
		x01 = y01,
		x02 = y02,
		x03 = y03,
		x04 = y04,
		x05 = y05,
		x06 = y06,
		x07 = y07,
		x08 = y08,
		x09 = y09,
		x10 = y10,
		x11 = y11,
		x12 = y12,
		x13 = y13,
		x14 = y14,
		x15 = y15;
	for (let i = 0; i < 8; i += 2) {
		x04 ^= rotl((x00 + x12) | 0, 7);
		x08 ^= rotl((x04 + x00) | 0, 9);
		x12 ^= rotl((x08 + x04) | 0, 13);
		x00 ^= rotl((x12 + x08) | 0, 18);
		x09 ^= rotl((x05 + x01) | 0, 7);
		x13 ^= rotl((x09 + x05) | 0, 9);
		x01 ^= rotl((x13 + x09) | 0, 13);
		x05 ^= rotl((x01 + x13) | 0, 18);
		x14 ^= rotl((x10 + x06) | 0, 7);
		x02 ^= rotl((x14 + x10) | 0, 9);
		x06 ^= rotl((x02 + x14) | 0, 13);
		x10 ^= rotl((x06 + x02) | 0, 18);
		x03 ^= rotl((x15 + x11) | 0, 7);
		x07 ^= rotl((x03 + x15) | 0, 9);
		x11 ^= rotl((x07 + x03) | 0, 13);
		x15 ^= rotl((x11 + x07) | 0, 18);
		x01 ^= rotl((x00 + x03) | 0, 7);
		x02 ^= rotl((x01 + x00) | 0, 9);
		x03 ^= rotl((x02 + x01) | 0, 13);
		x00 ^= rotl((x03 + x02) | 0, 18);
		x06 ^= rotl((x05 + x04) | 0, 7);
		x07 ^= rotl((x06 + x05) | 0, 9);
		x04 ^= rotl((x07 + x06) | 0, 13);
		x05 ^= rotl((x04 + x07) | 0, 18);
		x11 ^= rotl((x10 + x09) | 0, 7);
		x08 ^= rotl((x11 + x10) | 0, 9);
		x09 ^= rotl((x08 + x11) | 0, 13);
		x10 ^= rotl((x09 + x08) | 0, 18);
		x12 ^= rotl((x15 + x14) | 0, 7);
		x13 ^= rotl((x12 + x15) | 0, 9);
		x14 ^= rotl((x13 + x12) | 0, 13);
		x15 ^= rotl((x14 + x13) | 0, 18);
	}
	out[oi++] = (y00 + x00) | 0;
	out[oi++] = (y01 + x01) | 0;
	out[oi++] = (y02 + x02) | 0;
	out[oi++] = (y03 + x03) | 0;
	out[oi++] = (y04 + x04) | 0;
	out[oi++] = (y05 + x05) | 0;
	out[oi++] = (y06 + x06) | 0;
	out[oi++] = (y07 + x07) | 0;
	out[oi++] = (y08 + x08) | 0;
	out[oi++] = (y09 + x09) | 0;
	out[oi++] = (y10 + x10) | 0;
	out[oi++] = (y11 + x11) | 0;
	out[oi++] = (y12 + x12) | 0;
	out[oi++] = (y13 + x13) | 0;
	out[oi++] = (y14 + x14) | 0;
	out[oi++] = (y15 + x15) | 0;
};
const pbkdf2 = async (password, salt, options) => {
	const pwKey = await crypto.subtle.importKey(
		"raw",
		password,
		"PBKDF2",
		false,
		["deriveBits"],
	);
	const keyBuffer = await crypto.subtle.deriveBits(
		{
			name: "PBKDF2",
			hash: "SHA-256",
			salt,
			iterations: options.c,
		},
		pwKey,
		options.dkLen * 8,
	);
	return new Uint8Array(keyBuffer);
};
const BlockMix = (input, ii, out, oi, r) => {
	let head = oi + 0;
	let tail = oi + 16 * r;
	for (let i = 0; i < 16; i++) out[tail + i] = input[ii + (2 * r - 1) * 16 + i];
	for (let i = 0; i < r; i++, head += 16, ii += 16) {
		XorAndSalsa(out, tail, input, ii, out, head);
		if (i > 0) tail += 16;
		XorAndSalsa(out, head, input, (ii += 16), out, tail);
	}
};
const u32 = (arr) => {
	return new Uint32Array(
		arr.buffer,
		arr.byteOffset,
		Math.floor(arr.byteLength / 4),
	);
};
/*
The MIT License (MIT)

Copyright (c) 2022 Paul Miller (https://paulmillr.com)

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the “Software”), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/

class LuciaError extends Error {
	constructor(errorMsg, detail) {
		super(errorMsg);
		this.message = errorMsg;
		this.detail = detail ?? "";
	}
	detail;
	message;
}
const DEFAULT_ALPHABET = "abcdefghijklmnopqrstuvwxyz1234567890";
export const generateRandomString = (length, alphabet = DEFAULT_ALPHABET) => {
	const randomUint32Values = new Uint32Array(length);
	crypto.getRandomValues(randomUint32Values);
	const u32Max = 0xffffffff;
	let result = "";
	for (let i = 0; i < randomUint32Values.length; i++) {
		const rand = randomUint32Values[i] / (u32Max + 1);
		result += alphabet[Math.floor(alphabet.length * rand)];
	}
	return result;
};
export const generateScryptHash = async (s) => {
	const salt = generateRandomString(16);
	const key = await hashWithScrypt(s.normalize("NFKC"), salt);
	return `s2:${salt}:${key}`;
};
const hashWithScrypt = async (s, salt, blockSize = 16) => {
	const keyUint8Array = await scrypt(
		new TextEncoder().encode(s),
		new TextEncoder().encode(salt),
		{
			N: 16384,
			r: blockSize,
			p: 1,
			dkLen: 64,
		},
	);
	return convertUint8ArrayToHex(keyUint8Array);
};
export const validateScryptHash = async (s, hash) => {
	// detect bcrypt hash
	// lucia used bcrypt in one of the beta versions
	// TODO: remove in v3
	if (hash.startsWith("$2a")) {
		throw new LuciaError("AUTH_OUTDATED_PASSWORD");
	}
	const arr = hash.split(":");
	if (arr.length === 2) {
		const [salt, key] = arr;
		const targetKey = await hashWithScrypt(s.normalize("NFKC"), salt, 8);
		const result = constantTimeEqual(targetKey, key);
		return result;
	}
	if (arr.length !== 3) return false;
	const [version, salt, key] = arr;
	if (version === "s2") {
		const targetKey = await hashWithScrypt(s.normalize("NFKC"), salt);
		const result = constantTimeEqual(targetKey, key);
		return result;
	}
	return false;
};
const constantTimeEqual = (a, b) => {
	if (a.length !== b.length) {
		return false;
	}
	const aUint8Array = new TextEncoder().encode(a);
	const bUint8Array = new TextEncoder().encode(b);
	let c = 0;
	for (let i = 0; i < a.length; i++) {
		c |= aUint8Array[i] ^ bUint8Array[i]; // ^: XOR operator
	}
	return c === 0;
};
export const convertUint8ArrayToHex = (arr) => {
	return [...arr].map((x) => x.toString(16).padStart(2, "0")).join("");
};
